Principal minors, Part II: The principal minor assignment problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Principal minors, Part II: The principal minor assignment problem

The inverse problem of finding a matrix with prescribed principal minors is considered. A condition that implies a constructive algorithm for solving this problem will always succeed is presented. The algorithm is based on reconstructing matrices from their principal submatrices and Schur complements in a recursive manner. Consequences regarding the overdeterminancy of this inverse problem are ...

متن کامل

Solving the Principal Minor Assignment Problem and Related Computations

by Kent E Griffin, Ph.D. Washington State University August 2006 Chair: Michael J. Tsatsomeros An order O(2) algorithm for computing all the principal minors of an arbitrary n × n complex matrix is motivated and presented, offering an improvement by a factor of n over direct computation. The algorithm uses recursive Schur complementation and submatrix extraction, storing the answer in a binary ...

متن کامل

Principal minors, Part I: A method for computing all the principal minors of a matrix

An order O(2n) algorithm for computing all the principal minors of an arbitrary n× n complex matrix is motivated and presented, offering an improvement by a factor of n3 over direct computation. The algorithm uses recursive Schur complementation and submatrix extraction, storing the answer in a binary order. An implementation of the algorithm in MATLAB is also given and practical considerations...

متن کامل

Principal minors and rhombus tilings

The algebraic relations between the principal minors of an n× n matrix are somewhat mysterious, see e.g. [LS09]. We show, however, that by adding in certain almost principal minors, the relations are generated by a single relation, the so-called hexahedron relation, which is a composition of six cluster mutations. We give in particular a Laurent-polynomial parameterization of the space of n× n ...

متن کامل

Hyperdeterminantal relations among symmetric principal minors

The principal minors of a symmetric n×n-matrix form a vector of length 2n. We characterize these vectors in terms of algebraic equations derived from the 2×2×2-hyperdeterminant.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2006

ISSN: 0024-3795

DOI: 10.1016/j.laa.2006.04.009